منابع مشابه
An Improved Algorithm for Online Rectangle Filling
We consider the problem of scheduling resource allocation where a change in allocation results in a changeover penalty of one time slot. We assume that we are sending packets over a wireless channel of uncertain and varying capacity. In each time slot, a bandwidth of at most the current capacity can be allocated, but changing the capacity has a cost, which is modeled as an empty time slot. Only...
متن کاملTrust in Online Prescription Filling
This paper examines the impact of trust and uncertainty on online prescription filling. Drawing on prior research in consumer trust and theory of transaction cost economics, this paper proposes a research model to investigate the precedents of trust, the sources of uncertainty, and their relationships with the consumer’s intention to adopt online prescription filling. The model was empirically ...
متن کاملIndic scripts based online form filling - A usability exploration
Emerging Markets are very different from other developed markets in the diversity of the user needs, motivations and the business environment dynamics. The average citizen in the emerging markets, especially from the lower socio-economic segment, is not computer-savvy, and often only semi-literate. He or she is fluent in the local, and knows little or no English. Also, because of the poor penet...
متن کاملSquarability of rectangle arrangements
We study when an arrangement of axis-aligned rectangles can be transformed into an arrangement of axisaligned squares in R while preserving its structure. We found a counterexample to the conjecture of J. Klawitter, M. Nöllenburg and T. Ueckerdt whether all arrangements without crossing and side-piercing can be squared. Our counterexample also works in a more general case when we only need to p...
متن کاملVariable-Size Rectangle Covering
In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with the smallest number of directional antennas. In this paper, we consider the variable-size rectangle covering (VSRC) problem, which is a transformation of the DAC problem. There are n points above the base line y = 0 of the two-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.05.033